Contiguous file allocation in an extensible file system

ABSTRACT

Disclosed is a method for creating and reading a contiguous file in an extensible file system. During the creation of a file on the storage media, the file system format check the bitmap to determine if there are areas of free space on the media that would permit the storage of the file in a contiguous manner. By storing the file in a contiguous manner the file may later be read without resorting to the file allocation table, because the file itself would not be fragmented on the storage media. Once an area of free space has been identified, the file is written to the media in a contiguous manner. Further, an associated entry for the file in the directory entry is updated or created to indicate that the file is a contiguous file and also provides basic parameters necessary to read the file without resorting to accessing the file allocation table.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a divisional of U.S. patent application Ser. No. 12/389,391, entitled CONTIGUOUS FILE ALLOCATION IN AN EXTENSIBLE FILE SYSTEM filed Feb. 20, 2009, which: (i) claims the benefit of U.S. Provisional Application No. 61/030,043 entitled FILE ALLOCATION TABLE; (ii) is a Continuation-In-Part of U.S. application Ser. No. 11/229,485 entitled EXTENSIBLE FILE SYSTEM filed Sep. 16, 2005 which claims the benefit of U.S. Provisional Application No. 60/637,407; and (iii) is also a Continuation-In-Part of U.S. application Ser. No. 11/752,872 entitled EXTENDING CLUSTER ALLOCATIONS IN AN EXTENSIBLE FILE SYSTEM filed May 23, 2007 which claims the benefit of U.S. Provisional Application No. 60/802,922; the contents of U.S. application Ser. Nos. 11/229,485, 11/752,872, 12/389,391 and U.S. Provisional Application Nos. 61/030,043 are incorporated by reference herein in their entireties.

BACKGROUND

Generally described, there are a number of portable computing devices, such as digital still cameras, digital video cameras, media players, mobile phones, mobile computing devices, personal digital assistants, and the like that maintain data on a storage media, such as a portable storage media. The continued development of more complex portable computing devices and larger storage capacity portable storage media places a greater demand for flexibility on the file system format used on the storage media. Current file system format approaches can become deficient in that they may provide adequate flexibility for increasing storage size capacities and/or storage media applications.

SUMMARY

An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries.

In the confines of the extensible file system format a method for creating and reading a file in a contiguous format is provided. During the creation and/or modification of a file on the storage media, the file system format checks the free space bitmap to determine if there are areas of free space on the media that would permit the storage of the file in a contiguous manner. By storing the file in a contiguous manner the file may later be read without resorting to the file allocation table, because the file itself would not be fragmented on the storage media. Once an area of free space has been identified, the file is written to the media in a contiguous manner. Further, an associated entry for the file in the directory entry is updated or created to indicate that the file is a contiguous file and also provides basic parameters necessary to read the file without resorting to accessing the file allocation table.

This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This summary is not intended to identify key features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.

DESCRIPTION OF THE DRAWINGS

The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:

FIGS. 1A-1C are block diagrams illustrative of an illustrative environment including a portable computing device and a storage device implementing the extensible file system format in accordance with an aspect of the present invention;

FIG. 2 is a block diagram illustrative of various volume layout components corresponding to an extensible file system format in accordance with an aspect of the present invention;

FIG. 3 is a block diagram illustrative of an extensible file system directory structures including primary and secondary directory entry structures in accordance with an aspect of the present invention;

FIG. 4 is a block diagram illustrative of data components for implementing a boot process block in an extensible file system format in accordance with an aspect of the present invention;

FIG. 5 is a block diagram illustrative of data components for implementing directory entries in an extensible file system format in accordance with an aspect of the present invention

FIG. 6 is a block diagram illustrative of data components for implementing a file name and extensions in an extensible file system format in accordance with an aspect of the present invention;

FIG. 7 is a block diagram illustrative of data components for implementing a volume identifier in an extensible file system format in accordance with an aspect of the present invention;

FIG. 8 is a block diagram illustrative of data components for implementing an extensible directory entry in an extensible file system format in accordance with an aspect of the present invention;

FIG. 9 is a block diagram illustrative of data components for implementing an extensible directory entry in an extensible file system format in accordance with an aspect of the present invention;

FIG. 10 is a block diagram illustrative of data components for implementing an access control list in an extensible file system format in accordance with an aspect of the present invention; and

FIG. 11 is a flow diagram illustrative of a file name creation routine for an extensible file system format in accordance with an aspect of the present invention.

FIG. 12 is a flow diagram illustrating the creation and updating of a file as a contiguous file according to one illustrative embodiment.

FIG. 13 is a flow diagram illustrating the reading of a file when the file is a contiguous file according to one illustrative embodiment.

FIG. 14 is a general block diagram of a computing system in which embodiments of the present file system format may be practiced.

DETAILED DESCRIPTION

Generally described, the present invention relates to an extensible file system format and various processes associated with the extensible file system format. In an illustrative embodiment, the extensible file system format corresponds to an extensible file system format for portable storage media and various processes associated with the extensible file system format on the portable storage media. Although the present invention will be described with regard to a portable storage media file system format, one skilled in the relevant art will appreciate that the disclosed embodiments are illustrative in nature and should not be construed as limiting. Additionally, one skilled in the relevant art will appreciate that the data structures and data layouts used in the illustrative examples may require additional information related to performance, security, and the like.

FIGS. 1A-1C are block diagrams illustrative of various operating environments 100 for the extensible file system format of the present invention. With reference to FIG. 1A, in an illustrative embodiment, the extensible file system format is utilized to store data from a computing device, such as a mobile computing device 102, and a storage media, such as a portable storage media 104. In an illustrative embodiment, the mobile computing device 102 can correspond to any one of a variety of computing devices, including but not limited to, portable computing devices, mobile telephones, personal digital assistants, music players, media players. The portable storage media can also include, but is not limited to, hard drives, flash media, micro-drives and other storage media. In an illustrative embodiment, the extensible file system on the portable storage media 104 does not have to include any type of executable or readable software components, such as an operating environment, utilized by the mobile computing device 102. Alternatively, the extensible file system on the portable storage media 104 may include executable or readable software components used by the mobile device 102.

In an illustrative embodiment, the mobile computing device 102 may be in communication with other computing devices for collecting/exchanging data to be stored on the portable storage media 104. With reference to FIG. 1B, the mobile computing device 102 may be in direct communication with another computing device 106 and storage media 108. In an illustrative embodiment, the direct communication can correspond to various wired and wireless communication methods. In an illustrative embodiment, the other storage media 108 is not required to be formatted in accordance with the extensible file system format of the present invention. With reference to FIG. 1C, in a similar manner, the mobile computing device 102 may also be in communication with another computing device 110 and storage media 112, via a network connection. In an illustrative embodiment, the network connection can correspond to local area network (LAN) and wide area network (WAN) connections.

With reference now to FIG. 2, an illustrative embodiment volume layout 200 for an extensible file system format will be described. The volume layout 200 includes a boot parameters component 202 that include various information related to a description of the file system parameters of the partition. In an illustrative embodiment, the boot parameters component 202 can include code for bootstrapping from a defined partition, fundamental file system parameters for the defined partition, and various error checking information. A data structure for defining at least a portion of the boot parameters will be described below with regard to FIG. 4.

The volume layout 200 also includes an extensible parameters component, designated as OEM parameters 204, that define various additional data structures used in conjunction with the file system. In an illustrative embodiment, an original equipment manufacture (OEM) may specify various extensible data structures, such as performance parameters for a storage medium, that can be defined at time of manufacture. The volume layout 200 can further include a file allocation table component 206 that defines file and directory allocations. In an illustrative embodiment, each entry in the file allocation table component 206 corresponds to a 32 bit entry that represents an allocated cluster, an unallocated cluster or an unusable cluster. The volume layout 200 can still further include series of file data components 208A-208X that correspond to the data stored according to the file system format. Various data structures for defining a portion of the file data components 208A-208X will be defined with regard to FIGS. 3-10.

Turning now to FIG. 3, in one aspect, the file data components 208 may include one or more directory entries according to a directory structure 300. In an illustrative embodiment, directory structure 300 is organized into primary directory entries 302 and secondary directory entries 304. Each directory entry in the primary and secondary entries is typed. For example, in an illustrative embodiment, type values for the primary and secondary directory entries can correspond to a range of 1 255. Primary directory entries 302 correspond to the entries in the root directory of the file system. Secondary directory entries 304 follow a primary directory entry and are associated with the primary directory entry. Secondary directory entries extend the metadata associated with the correlated primary directory entry.

With continued reference to FIG. 3, in an illustrative embodiment, the primary directory entries 302 can be further classified as critical primary directory entries 306 and benign primary directory entries 308. Critical primary directory entries 306 define potentially different formats for each directory entry. In an illustrative embodiment, an operating environment will not mount a volume corresponding to the extensible file system format with an unknown critical primary directory entry, as will be described below. Examples of known primary directory entries 306 can include allocation bitmaps, up case tables, volume labels, encryption keys, and normal directory entries. The allocation bitmap of the exFAT volume of the present embodiments maintains a record of the allocation states of all clusters on the storage media. This is a significant departure from the structure of other FAT systems (e.g. FAT 12, FAT 16, and FAT 32), in which a FAT maintained a record of the allocation state of all clusters in the cluster heap. Each bit in the allocation bitmap indicates whether its corresponding cluster is available for allocation or not. The clusters in the bitmap may be represented from lowest to highest index. In order to keep simplicity and to enable implementations on devices with limited memory and processor capacity, the file directory structure has been kept unsorted and “flat”. The exFAT embodiments also enable many files (e.g., up to 2,796,202) in a single directory. In order to find if a target file name exists in a “flat” unsorted directory structure (for example, to create, open, update, or delete a file with that name), a comparison of the target file name can be done against the directory structure's relevant. Directory entries instead of going to the FAT table.

Benign primary directory entries 308 also define potential different formats for each directory entry, but can be ignored by the file system if a particular benign primary directory entry is not understood. Benign primary directory entries 308 can be associated with another cluster chain of the volume. Additionally, benign primary directory entries 308 can also be associated a number of secondary directory entries 304.

In a manner similar to primary directory entries 302, secondary directory entries 304 may also be further classified as critical secondary directory entries 310 and benign secondary directory entries 312. As described above, the critical secondary directory entries 310 and benign secondary directory entries 312 are associated with a benign primary directory entry and extend the metadata associated with the primary directory entry. Both the critical secondary directory entries 310 and the benign secondary directory entries 312 can be associated with another cluster chain of the volume.

To mount a corresponding to the extensible file system format, the file system implements a mount volume procedure. In an illustrative embodiment, the mount volume procedure attempts to a look at a version number for the volume. If the version number is not understood (e.g., the version number is higher), the volume will not be mounted. During a normal directory enumeration, any critical primary directory entries not known by the file system will prevent the volume from being mounted. Thereafter, various user initiated processes, such as a file open, will cause the file system to enumerate the secondary directory entries. If the critical secondary directory entries 310 are not known by a file system, the entire directory entry will be skipped. Additionally, if benign secondary directory entries 312 are not known by the file system, the particular unknown benign secondary directory entry will be ignored.

With reference now to FIG. 4, a block diagram illustrative of data components 400 for implementing a boot process block in the boot parameters component 202 (FIG. 2) will be described. The data components 400 include an OEM name component 402 for specifying a name for the file system format of the storage media. The data components 400 also include a data size descriptor component 404 for specifying various characteristics of the data stored in the file system. For example, the data size descriptor component 404 can specify a count of bytes per sector, a number of sectors per allocation unit, a FAT table offset, and a count of sectors for all data structures. The data components include an active FAT flags component 406 for specifying a number of active FATs on the file system. In an illustrative embodiment, a file system may support multiple FATs for utilization with some operating system environments. The data components 400 can further include a volume identification component 408 for identifying a volume serial number and/or version number. Still further, the data components 400 can include a file system type for specifying the file system format for the file system. One skilled in the relevant art will appreciate that the data components 400 can include a number of additional/alternative rows for implementing the above identified components 402 410 and additional components.

Turning now to FIG. 5, a block diagram illustrative of data components 500 for implementing directory entries in an extensible file system format will be described. The data components 500 include an in use component 502 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 500 further include a type designation component 504 for specifying that the directory entry is associated with a normal directory entry. The data components 500 further include a secondary directory entries component 506 for specifying a number of secondary entries associated with the normal directory entry. The data components 500 also include a file attributes component 508 for specifying various file system attributes for the directory entry. Still further, the data components 500 include a time component 510 for specifying various time information such as a creation timestamp, modification time stamp and other time information. Additionally, the data components 500 further include a time zone component 512 for specifying a time zone for the last created time stamp. One skilled in the relevant art will appreciate that the data components 500 can include a number of additional/alternative rows for implementing the above identified components 502 512 and additional components.

Turning now to FIG. 6, a block diagram data components 600 for implementing a file name and extensions will be described. The data components 600 include an in use component 602 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 600 further include a type designation component 604 for specifying that the directory entry is associated with a file system name. The data components further include a file name length component 606 and a file name has component 608. The utilization of the file name hash component 608 will be described below. The data components 600 also include a file name component 610 for specifying the file name. One skilled in the relevant art will appreciate that the data components 600 can include a number of additional/alternative rows for implementing the above identified components 602 610 and additional components. Additionally, file name directory entries may be extended by secondary directory entries.

Turning now to FIG. 7, a block diagram illustrative of data components 700 for implementing a volume identifier in an extensible file system format is provided. The data components 700 include an in use component 702 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 700 further include a type designation component 704 for specifying that the directory entry is associated with a volume identifier. The data components 700 further include a secondary directory entries component 706 for specifying a number of secondary entries associated with the volume identifier. The data components 700 also include a volume identifier 708, such as a global unique identifier. One skilled in the relevant art will appreciate that the data components 700 can include a number of additional/alternative rows for implementing the above identified components 702-708 and additional components. Additionally, in an illustrative embodiment, the data components 700 correspond to a benign directory entry that can be ignored by a file system that does not support volume identifiers.

With reference now to FIGS. 8 and 9, in an illustrative embodiment, parties, such as an OEM, may be able to define specific benign primary directory entry types 308 and benign secondary directory entry types 312. As discussed above, in the event the file system would not recognize or understand either the specific benign primary directory entry types 308 or benign secondary directory entry types 312, the file system could ignore the defined directory entry types.

With reference to FIG. 8, a block diagram illustrative of data components 800 for implementing an extensible benign primary directory entry 308 in an extensible file system format will be described. The data components 800 include an in use component 802 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 800 further include a type designation component 804 for specifying that the directory entry is a benign primary directory entry. The data components 800 further include a secondary directory entries component 806 for specifying a number of secondary entries associated with the volume identifier. The data components 800 also include a volume identifier 808, such as a global unique identifier. The data components 800 can further include a flag component 810 that corresponds to an indication of whether contiguous allocation of a cluster chain is to be implemented. The data components 800 can further include additional information 812, such as verification information and a starting cluster. As will be explained in greater detail below, cluster chains utilizing contiguous allocation can be defined according to cluster chain size and a starting cluster for the first cluster in the chain. One skilled in the relevant art will appreciate that the data components 800 can include a number of additional/alternative rows for implementing the above identified components 802-812 and additional components.

With reference to FIG. 9, a block diagram illustrative of data components 900 for implementing a benign secondary directory entry in an extensible file system format will be described. The data components 900 include an in use component 902 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 900 further include a type designation component 904 for specifying that the directory entry is a benign primary directory entry. The data components 900 further include a secondary directory entries component 906 for specifying a number of secondary entries associated with the volume identifier. The data components 900 also include a volume identifier 908, such as a global unique identifier. The data components 900 can further include a flag component 910 that corresponds to an indication of whether contiguous allocation of a cluster chain is to be implemented. The data components 900 can further include additional information 912, such as verification information and a starting cluster. One skilled in the relevant art will appreciate that the data components 900 can include a number of additional/alternative rows for implementing the above identified components 902-912 and additional components.

In an illustrative embodiment, a benign primary directory entry and/or secondary directory entries may be associated with access control list (ACL) information. FIG. 10 is a block diagram illustrative of data components 1000 for implementing an access control list in an extensible file system format. The data components 1000 include an in use component 1002 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 1000 further include a type designation component 1004 for specifying that the directory entry is an ACL directory entry. The data components 1000 further include a number of ACL fields 1006, such as ACL flags, pointers to ACL databases, and the like. One skilled in the relevant art will appreciate that the data components 1000 can include a number of additional/alternative rows for implementing the above identified components 1002 1006 and additional components.

With reference now to FIG. 11, a file name creation routine 1100 for an extensible file system format will be described. At block 1102, a file system obtains a request to create a directory entry with a specific file name. In an illustrative embodiment, the specific file name can correspond to a naming convention, such as a digital camera picture naming convention. At block 1104, the file system generates a target name hash. At block 1106, an iterative loop is begun by examining the next directory entry hash value. An illustrative directory entry type for storing directory entry hash values is described above with regard to data components 600 (FIG. 6).

At decision block 1108, a test is conducted to determine whether the target hash value matches the current directory entry hash value. If they do not match, the routine 1100 returns to block 1106 (until all the directory entries have been examined. If the hash values match at decision block 1108, at block 1110, the file system obtains the full file name for the potentially matching directory entry. An illustrative directory entry type for storing directory entry full file names is described above with regard to data components 600 (FIG. 6). At decision block 1112, a test is conducted to determine whether the target file name matches the full file name of the potentially matching directory entry. If so, the routine 1100 terminates by reporting a conflict and the file system will be required to select a new file name. If the full file does not match, the routine 1100 will return to block 1106 to continue checking hash values for all the directory entries in the file system.

In accordance with an aspect of the present invention, various additional functionality may be added through the specification of specific directory types. For example, name streams may be supported by specifying a name stream directory entry. Additionally, on disk encryption may also be supported through the utilization of specific encryption algorithms and key exchanges. Still further, time zone conversions may be associated with directory entries to automatically convert a current time zone with a time zone with the directory entry was made.

FIG. 12 is a flow diagram illustrating a process for creating or allocating a file as a contiguous file in the extensible file system format, according to at least one embodiment. Contiguous files are files that are stored on the storage media in such a manner that they are not fragmented by clusters in between clusters that store the data for the file. The process of FIG. 12 will be discussed in general terms and is applicable to any type of file that may be stored on the storage media.

To start the creation process, data associated with the file to be stored is received at the storage media. This file data can be any type of file and may have originated at any source. For example, the data may be a document, a photograph, a music file, a media file, or any other type of data file that may be stored. Further, the file may have originated or been generated at a personal computer, a camera, a digital media player, or any other consumer electronics device. The receipt of this data is illustrated at step 1210.

Once the data has been received at the storage media, the amount of space needed to store the file is determined. This is illustrated at step 1220. Depending on the configuration of the storage media and the device providing the data, the determined amount of space may be described as in the number of clusters needed or the actual size in bytes of the file. The process of FIG. 12 also scans the bitmap associated with the storage media to identify free space on the storage media. This is illustrated at 1230. The free space on the storage media is unused space that the storage media has allocated for storage of files and other data.

Once the available free space on the storage media has been identified, the process of FIG. 12 determines if there is a section or area of free space on the storage media that is the same size or is larger than the size of the file to be stored. For example, that is large enough to contain the entire file to be stored. This identification of the size of the free space is used to determine if the file can be stored as a contiguous file. The identification of the free space is illustrated at 1240.

If there is an area of free space on the storage media that is the same size or larger than the size of the file, then the file is written to the storage media as a contiguous file. This is illustrated at 1250. In contrast to typical methods of writing a file to a storage media, the process of writing a contiguous file avoids writing any information to the File Allocation Table. At step 1250, an entry in the directory entry for the file is created and the file size (either in bytes or clusters) and starting cluster are placed in the directory entry for the file. The directory entry can be either the primary or secondary directory entry discussed earlier. Additionally, a bit in the directory entry is set to indicate that the file is a contiguous file. This information stored in the directory entry allows for faster reading of the file and will be discussed in greater detail with respect to FIG. 13. When enough free space cannot be found at step 1240, then the file is written to the storage media as a fragmented file using the File Allocation Table, as shown at step 1260.

The process of FIG. 12 can also be used when the file has previously been stored on the storage media. In this embodiment the stored file is updated by a device that is configured to modify the file. The modification of the file can either cause the file to become larger, such as when a user adds data to the file, or become smaller, such as when the user removes data or compresses the file. Depending on the nature of the update (enlarging or shrinking the size of the file) slightly different processes are performed at the steps of FIG. 12.

In the situation where the file is updated to be a larger file the process of FIG. 12 first determines if there is enough free space left in the area of free space where the file is currently stored, to write the updated file. If there is enough free space in the area of free space contiguous to the previous allocation, the updated file is simply written to this area of free space. At this time the directory entry for the file is updated to reflect the change in the number of clusters and size of the file. If the area of free space is not large enough to store the updated file, the process of FIG. 12, in some embodiments, repeats step 1240 to attempt to identify if there is another area of free space that is large enough to write the updated file as a contiguous file. If another area of free space that is large enough for the updated file is identified, the updated file is written to the storage media in the other area of free space and the associated entries in the directory entry are updated.

However, when another sufficiently large area of free space cannot be located on the storage media, the file is stored on the storage media as any other non-contiguous file would be stored, as shown by step 1260. That is, the file is fragmented such that part of the file is stored in a first set of clusters and another part of the file is stored in a second set of clusters that is not contiguous with the first set. Further, the directory entry for the file is modified by deselecting the contiguous file bit so that the file is no longer indicated as being contiguous. As the file is written in a non-contiguous manner, the File Allocation Table is updated to include the information necessary to retrieve the file from the storage media.

In the situation where the updated file is smaller than the original file the process of FIG. 12 determines if the file is already a contiguous file. If the file is already contiguous the updated file is written in the current location and the associated entry in the directory entry is updated to reflect the new size of the file. However, if the original file is not a contiguous file, the process determines whether the updated file can be written in a contiguous manner. The process for determining if the file is to be written in a contiguous manner is executed according to steps 1210-1250 discussed above. However, at step 1240, the process considers the space currently occupied by the file as being free space.

FIG. 13 is a flow diagram illustrating a process for reading a contiguous file in the extensible file system format from the storage media, according to at least one embodiment. The process of FIG. 13 begins when the storage media receives an indication of the file that is to be read from the storage media. For example the indication can be the name of the file. This is illustrated at 1310. Next the process of FIG. 13 identifies an entry in the directory entry for the indicated file. This is illustrated at 1320. Once an entry in the directory entry is located, the process then determines if the file is a contiguous file. This is illustrated at 1330. If the entry is not identified as contiguous the process reads the file in a conventional manner using the FAT table, as shown at step 1350. In one embodiment the process determines if a contiguous file flag or bit is set in the directory entry for the file. If the file is determined to be a contiguous file the file is read from the storage media without accessing the File Allocation Table. This is illustrated at 1340. In one embodiment the process reads the file without using the File Allocation Table, by obtaining the starting cluster location for the file from the directory entry. The process also determines the number of clusters used by the file from the directory entry. If the entry for the filed does not contain the number of clusters, the process can calculate the number of clusters by dividing the file size obtained from the directory entry by a known cluster size for the storage media. Then the process obtains the entire file by reading from the bitmap from the starting cluster that number of clusters indicated by the directory entry.

FIG. 14 illustrates an example of a suitable computing system environment 1400 on which the extensible file system format of the present discussion may be implemented. The computing system environment 1400 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality. Neither should the computing environment 1400 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 1400.

The extensible file system format is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with the extensible file system format include, but are not limited to, personal computers, server computers, hand-held or laptop devices (such as mobile phones, media players, etc.), multiprocessor systems, microprocessor-based systems, set top boxes, media kiosks, consumer electronics (such as televisions, optical disk players, digital picture frames, etc.), network PCs, minicomputers, mainframe computers, telephony systems, distributed computing environments that include any of the above systems or devices, and the like.

With reference to FIG. 14, an exemplary system for implementing the extensible file system format includes a general-purpose computing device in the form of a computer 1410. Components of computer 1410 may include, but are not limited to, a processing unit 1420, a system memory 1430, and a system bus 1421 that couples various system components including the system memory to the processing unit 1420. The system bus 1421 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.

Computer 1410 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 1410 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer readable storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 1410. Combinations of any of the above should also be included within the scope of computer readable media.

The system memory 1430 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 1431 and random access memory (RAM) 1432. A basic input/output system 1433 (BIOS), containing the basic routines that help to transfer information between elements within computer 1410, such as during start-up, is typically stored in ROM 1431. RAM 1432 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 1420. By way of example, and not limitation, FIG. 14 illustrates operating system 1434, application programs 1435, other program modules 1436, and program data 1437.

The computer 1410 may also include other removable/non-removable volatile/nonvolatile computer storage media. By way of example only, FIG. 14 illustrates a hard disk drive 1441 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 1451 that reads from or writes to a removable, nonvolatile magnetic disk 1452, and an optical disk drive 1455 that reads from or writes to a removable, nonvolatile optical disk 1456 such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 1441 is typically connected to the system bus 1421 through a non-removable memory interface such as interface 1440, and magnetic disk drive 1451 and optical disk drive 1455 are typically connected to the system bus 1421 by a removable memory interface, such as interface 1450.

The drives and their associated computer storage media discussed above and illustrated in FIG. 14, provide storage of computer readable instructions, data structures, program modules and other data for the computer 1410. In FIG. 14, for example, hard disk drive 1441 is illustrated as storing operating system 1444, application programs 1445, other program modules 1446, and program data 1447. Note that these components can either be the same as or different from operating system 1434, application programs 1435, other program modules 1436, and program data 1437. Operating system 1444, application programs 1445, other program modules 1446, and program data 1447 are given different numbers here to illustrate that, at a minimum, they are different copies. In some embodiments, at least a portion of processes described above may be implemented by computer readable instructions executable by one or more computing devices.

A user may enter commands and information into the computer 1410 through input devices such as a keyboard 1462, a microphone 1463, and a pointing device 1461, such as a mouse, trackball or touch pad. Other input devices (not shown) may include a joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 1420 through a user input interface 1460 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 1491 or other type of display device is also connected to the system bus 1421 via an interface, such as a video interface 1490. In addition to the monitor, computers may also include other peripheral output devices such as speakers 1497 and printer 1496, which may be connected through an output peripheral interface 1490.

The computer 1410 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 1480. The remote computer 1480 may be a personal computer, a hand-held device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 1410. The logical connections depicted in FIG. 14 include a local area network (LAN) 1471 and a wide area network (WAN) 1473, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.

When used in a LAN networking environment, the computer 1410 is connected to the LAN 1471 through a network interface or adapter 1470. When used in a WAN networking environment, the computer 1410 typically includes a modem 1472 or other means for establishing communications over the WAN 1473, such as the Internet. The modem 1472, which may be internal or external, may be connected to the system bus 1421 via the user input interface 1460, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 1410, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 14 illustrates remote application programs 1485 as residing on remote computer 1480. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

While illustrative embodiments have been illustrated and described, it will be appreciated that various changes can be made therein without departing from the spirit and scope of the invention. 

What is claimed is:
 1. A computer-implemented method of writing, by a file system of a computer system, a file to a storage media comprising: receiving data associated with the file to be written; determining an amount of space associated with the file; reading a bitmap associated with the storage media to identify areas of free space on the media; identifying from the areas of free space on the storage media contiguous free space equal to or greater than the space associated with the file; writing the file to the storage media as a contiguous file when an area of contiguous free space on the media greater than or equal to the space associated with the file is identified; and setting a contiguous file flag in a directory entry associated with the file in a file directory of the storage medium, when the file is written as a contiguous file, without storing information about the contiguously written file in a file allocation table of the storage medium.
 2. The method of claim 1 wherein writing the file to the storage media, further comprises: setting a file size entry of the directory entry associated with the file in the file directory of the storage media, the file directory being separate from the file allocation table; and setting a starting cluster indication entry of the directory entry associated with the file in the file directory.
 3. The method of claim 1 wherein when the file is written to the storage media as a contiguous file, the file allocation table for the storage media is not updated.
 4. The method of claim 1 wherein receiving data associated with the file receives data indicative of an update to a file that is stored previously on the storage media, the method further comprising: determining if there is enough free space in the area of contiguous free space for the updated file; writing the updated file in the area of contiguous free space when there is enough free space.
 5. The method of claim 1 wherein receiving data associated with the file receives data indicative of an update to a file that is stored previously on the storage media in a non-contiguous manner, the method further comprising: determining that the amount of space associated with the updated file is smaller than an amount of space currently occupied by the file on the storage media; searching the bitmap to identify contiguous free space that is greater than the amount of space associated with the updated file; deleting the file from the storage media and writing the updated file to the identified contiguous free space when the updated file can be written in a contiguous manner; and updating the contiguous file flag in the directory entry associated with the file to indicate that the file is now contiguously written, without storing information about the contiguously written file in the file allocation table of the storage medium.
 6. The method of claim 1 wherein the received data associated with the file to be written is received from a consumer electronics device.
 7. The method of claim 1 wherein receiving data associated with the file receives data indicative of an update to a file that is stored previously on the storage media, the method further comprising: determining if there is enough free space in the area of contiguous free space for the updated file; when there is not enough free space in the area of contiguous free space for the updated file, reading the bitmap to identify if there is another area of free space on the storage media that has contiguous free space that is greater than or equal to the space associated with the updated file; writing the updated file to the another area of contiguous free space when the another area of contiguous free space is identified as having contiguous free space greater than or equal to the space associated with the updated file; and when there is not another area of contiguous free space on the storage media for the updated file, writing the updated file to the storage media in a non-contiguous manner; clearing the contiguous file flag in the directory entry for the file; and updating the file allocation table with information about the non-contiguously written file.
 8. A computing device having storage that stores computer-executable instructions and a processor for executing the instructions, the instructions, when executed by the processor, causing the device to perform operations comprising: receiving data associated with a file to be written to a storage media; determining an amount of space associated with the file; reading a bitmap associated with the storage media to identify areas of free space on the media; identifying from the areas of free space on the storage media contiguous free space equal to or greater than the space associated with the file; writing the file to the storage media as a contiguous file when an area of contiguous free space on the media greater than or equal to the space associated with the file is identified; and setting a contiguous file flag in a directory entry associated with the file in a file directory of the storage medium, when the file is written as a contiguous file, without storing information about the contiguously written file in a file allocation table of the storage medium.
 9. The computing device of claim 8 wherein the operation of writing the file to the storage media, further comprises: setting a file size entry of the directory entry associated with the file in the file directory of the storage media, the file directory being separate from the file allocation table; and setting a starting cluster indication entry of the directory entry associated with the file in the file directory.
 10. The computing device of claim 8 wherein when the file is written to the storage media as a contiguous file, the file allocation table for the storage media is not updated.
 11. The computing device of claim 8 wherein receiving data associated with the file receives data indicative of an update to a file that is stored previously on the storage media, and wherein the operations further comprise: determining if there is enough free space in the area of contiguous free space for the updated file; writing the updated file in the area of contiguous free space when there is enough free space; when there is not enough free space in the area of contiguous free space for the updated file, reading the bitmap to identify if there is another area of free space on the storage media that has contiguous free space that is greater than or equal to the space associated with the updated file; writing the updated file to the another area of contiguous free space when the another area of contiguous free space is identified as having contiguous free space greater than or equal to the space associated with the updated file; and when there is not another area of contiguous free space on the storage media for the updated file, writing the updated file to the storage media in a non-contiguous manner; clearing the contiguous file flag in the directory entry for the file; and updating the file allocation table with information about the non-contiguously written file.
 12. The computing device of claim 8 wherein receiving data associated with the file receives data indicative of an update to a file that is stored previously on the storage media in a non-contiguous manner, and wherein the operations further comprise: determining that the amount of space associated with the updated file is smaller than an amount of space currently occupied by the file on the storage media; searching the bitmap to identify contiguous free space that is greater than the amount of space associated with the updated file; deleting the file from the storage media and writing the updated file to the identified contiguous free space when the updated file can be written in a contiguous manner; and updating the contiguous file flag in the directory entry associated with the file to indicate that the file is now contiguously written, without storing information about the contiguously written file in the file allocation table of the storage medium.
 13. The computing device of claim 8 wherein the received data associated with the file to be written is received from a consumer electronics device. 